On diameter perfect constant-weight ternary codes
نویسندگان
چکیده
منابع مشابه
On diameter perfect constant-weight ternary codes
From cosets of binary Hamming codes we construct diameter perfect constantweight ternary codes with weight n − 1 (where n is the code length) and distances 3 and 5. The class of distance 5 codes has parameters unknown before.
متن کاملOn Perfect Ternary Constant Weight Codes
We consider the space of ternary words of length n and fixed weightwwith the usual Hamming distance. A sequence of perfect single error correcting codes in this space is constructed. We prove the nonexistence of such codes with other parameters than those of the sequence.
متن کاملTernary Constant Weight Codes
Let A3(n, d,w) denote the maximum cardinality of a ternary code with length n, minimum distance d, and constant Hamming weight w. Methods for proving upper and lower bounds on A3(n, d,w) are presented, and a table of exact values and bounds in the range n ≤ 10 is given.
متن کاملNon-existence of a ternary constant weight (16, 5, 15;2048) diameter perfect code
Ternary constant weight codes of length n = 2m, weight n − 1, cardinality 2n and distance 5 are known to exist for every m for which there exists an APN permutation of order 2m, that is, at least for all odd m ≥ 3 and for m = 6. We show the non-existence of such codes for m = 4 and prove that any codes with the parameters above are diameter perfect.
متن کاملEnumeration of some optimal ternary constant-weight codes
We consider the problem of classification of optimal ternary constantweight codes. We use combinatorial and computer methods to find inequivalent codes for some cases for 3 ≤ d ≤ n ≤ 9.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2008
ISSN: 0012-365X
DOI: 10.1016/j.disc.2007.08.037